Random-link matching problems on random regular graphs
نویسندگان
چکیده
منابع مشابه
On the asymmetry of random regular graphs and random graphs
This paper studies the symmetry of random regular graphs and random graphs. Our main result shows that for all 3 ≤ d ≤ n − 4 the random d-regular graph on n vertices almost surely has no non-trivial automorphisms. This answers an open question of N. Wormald [13].
متن کاملOn the solution of the random link matching problems
2014 We show that the replica symmetric solution of the matching problem (bipartite or not) with independent random distances is stable. We compute the fluctuations and get the O (1/N) corrections to the length of the optimal matching in a generic sample. J. Physique 48 (1987) 1451-1459 SEPTEMBRE 1987, Classification Physics Abstracts 02.10+W 64.40 Cn 75.10 Nr
متن کاملMaximum matching on random graphs
– The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree c is larger than 2.7183, groups of max-matching patterns which differ greatly from each other gradually emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on t...
متن کاملLearning Random Regular Graphs
The family of random regular graphs is a classic topic in the realms of graph theory, combinatorics and computer science. In this paper we study the problem of learning random regular graphs from random paths. A random regular graph is generated uniformly at random and in a standard label-guided graph exploration setting, the edges incident from a node in the graph have distinct local labels. T...
متن کاملRandom strongly regular graphs?
Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36,10,4,2), but there are 32548 non-isomorphic graphs with parameters (36,15,6,6). (The first assertion is a special case of a theorem of Shrikhande, while the second is the result of a computer search by McKay and Spence.) In the light of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2020
ISSN: 1742-5468
DOI: 10.1088/1742-5468/ab7127